Disjunctive Deductive Databases : Semantics , Updates , and Architecture ?
نویسندگان
چکیده
The basic assumption in relational and deductive databases is that there are no gaps in our knowledge. That is, the database cannot store data that contain null values or data that is indeenite. In practical situations knowledge is not precise, and there are gaps in our knowledge. These gaps may be due to null values in the data, may arise when we combine several databases that lead to inconsistent theories, or may occur because information is indeenite in nature, such as in military or medical applications. In this paper we describe semantics for disjunctive deductive databases that extend the work in deductive databases, solve the view update problem, and permit indeenite data to be represented eeciently. Hierarchic, stratiied, and normal stable models of disjunctive databases are described. An architecture is proposed for a disjunctive deductive database system and a class of theories for which the architecture will be eeective is discussed.
منابع مشابه
View Updates in Disjunctive Deductive Databases Based on SLD-Resolution
View update problem in deductive databases is concerned with the translation of an update of an intensional relation by modifying the underlying relations of the extensional part of the database. In the existing algorithms for view updates of a deductive database, a sound and complete proof procedure is usually employed to generate explanations for the atom to be inserted or deleted. In the cas...
متن کاملThe Architecture of a Disjunctive Deductive Database System
Disjunctive Deductive Databases (DDDBs) | function-free disjunctive logic programs with negation in rule bodies allowed | have been recently recognized as a powerful tool for knowledge representation and commonsense reasoning. Much research has been spent on issues like semantics and complexity of DDDBs, but the important area of implementing DDDBs has been less addressed so far. However, a tho...
متن کاملPossible Model Semantics for Disjunctive Databases
This paper presents a novel approach to the semantics of deductive databases. The possible model semantics is introduced as an alternative approach to the classical minimal model semantics. The possible model semantics can distinguish both inclusive and exclusive disjunctions, and provide a exible mechanism for inferring negation in disjunctive databases. The possible model semantics is charact...
متن کاملUpdates in Disjunctive Deductive Databases: A Minimal Model Based Approach
The issue of updates in Disjunctive Deductive Databases (DDDBs) under the minimal model semantics is addressed. We consider ground clause addition and deletion in a DDDB. The approach of this paper is based on manipulating the clauses of the theory to produce the required change to the minimal model structure necessary to achieve the clause addition/deletion update. First we deal with ground po...
متن کاملAggregation in Disjunctive Deductive Databases
Practical applications of deductive databases often require the use of extended features like disjunctive information, aggregation operators or default negation. But it has been unclear how one could deal with aggregation in the presense of recursion and disjunction. Usually , there is the requirement that deductive databases must be stratiied w.r.t. aggregation, i.e. a predicate q that is deen...
متن کامل